The Polynomial Method

نویسنده

  • Larry Guth
چکیده

The way we were thinking about this was to draw circles around the points under consideration, and noting that we expect a great many points to lie on the boundaries of other circles. But clearly, in that setting, we are not using all the information we have; in particular, we are never accounting for the fact that some of the circles may have equal radii, which would also decrease the value of t. How can we somehow encode this information? Suppose we denote our set of points in the plane by P ⊂ R; let d(P ) be the set of nonzero distances between points in P , and Q(P ) be a measure of how two different pairs of points can have the same nonzero distance between them. Formally speaking,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical solution of a system of fuzzy polynomial equations by modified Adomian decomposition method

In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.

متن کامل

Adomian Polynomial and Elzaki Transform Method of Solving Fifth Order Korteweg-De Vries Equation

Elzaki transform and Adomian polynomial is used to obtain the exact solutions of nonlinear fifth order Korteweg-de Vries (KdV) equations. In order to investigate the effectiveness of the method, three fifth order KdV equations were considered. Adomian polynomial is introduced as an essential tool to linearize all the nonlinear terms in any given equation because Elzaki transform cannot handle n...

متن کامل

Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

متن کامل

A method to obtain the best uniform polynomial approximation for the family of rational function

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

متن کامل

Non-polynomial Spline Method for Solving Coupled Burgers Equations

In this paper, non-polynomial spline method for solving Coupled Burgers Equations are presented. We take a new spline function. The stability analysis using Von-Neumann technique shows the scheme is unconditionally stable. To test accuracy the error norms 2L, L are computed and give two examples to illustrate the sufficiency of the method for solving such nonlinear partial differential equation...

متن کامل

NON-POLYNOMIAL SPLINE SOLUTIONS FOR SPECIAL NONLINEAR FOURTH-ORDER BOUNDARY VALUE PROBLEMS

We present a sixth-order non-polynomial spline method for the solutions of two-point nonlinear boundary value problem u(4)+f(x,u)=0, u(a)=α1, u''(a)= α2, u(b)= β1,u''(b)= β2, in off step points. Numerical method of sixth-order with end conditions of the order 6 is derived. The convergence analysis of the method has been discussed. Numerical examples are presented to illustrate the applications ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012